Secure multi-party computation protocol for sequencing problem
نویسندگان
چکیده
منابع مشابه
A Modified ck-Secure Sum Protocol for Multi-Party Computation
Secure Multi-Party Computation (SMC) allows multiple parties to compute some function of their inputs without disclosing the actual inputs to one another. Secure sum computation is an easily understood example and the component of the various SMC solutions. Secure sum computation allows parties to compute the sum of their individual inputs without disclosing the inputs to one another. In this p...
متن کاملA Protocol for Secure 2-Party Computation
We present a protocol for secure 2-party computation based on homomorphic encryption along with a basic implementation of the protocol. Secure 2-party computation allows two parties to compute some function of their respective inputs in collaboration without revealing the inputs, unless both parties agree to do so. The presented protocol is based on additive sharing and homomorphic encryption a...
متن کاملUnconditionally Secure Multi-Party Computation
The most general type of multi-party computation involves n participants. Participant i supplies private data xi and obtains an output function fi(x1, . . . , xn). The computation is said to be unconditionally secure if each participant can verify, with probability arbitrarily close to one, that every other participant obtains arbitrarily little information beyond their agreed output fi. We giv...
متن کاملHeterogeneous Secure Multi-Party Computation
The increased processing power and storage capacity of inhome and mobile computing devices has motivated their inclusion in distributed and cloud computing systems. The resulting diverse environment creates a strong requirement for secure computations, which can be realised by Secure Multi-Party Computation (MPC). However, MPC most commonly assumes that parties performing the secure computation...
متن کاملEfficient Secure Multi-party Computation
Since the introduction of secure multi-party computation, all proposed protocols that provide security against cheating players suffer from very high communication complexities. The most efficient unconditionally secure protocols among n players, tolerating cheating by up to t < n/3 of them, require communicating O(n6) field elements for each multiplication of two elements, even if only one pla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2011
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-011-4272-1